The Complexity of Quickly ORM-Decidable Sets
نویسندگان
چکیده
The Ordinal Register Machine (ORM) is one of several different machine models for infinitary computability. We classify, by complexity, the sets that can be decided quickly by ORMs. In particular, we show that the arithmetical sets are exactly those sets that can be decided by ORMs in times uniformly less than ω. Further, we show that the hyperarithmetical sets are exactly those sets that can be decided by an ORM in time uniformly less than ω 1 .
منابع مشابه
A Decidable Very Expressive Description Logic for Databases (Extended Version)
We introduce DLR, an extension of the n-ary propositionally closed description logic DLR to deal with attribute-labelled tuples (generalising the positional notation), projections of relations, and global and local objectification of relations, able to express inclusion, functional, key, and external uniqueness dependencies. The logic is equipped with both TBox and ABox axioms. We show how a si...
متن کاملA Decidable Very Expressive Description Logic for Databases
We introduce DLR ,̀ an extension of the n-ary propositionally closed description logic DLR to deal with attribute-labelled tuples (generalising the positional notation), projections of relations, and global and local objectification of relations, able to express inclusion, functional, key, and external uniqueness dependencies. The logic is equipped with both TBox and ABox axioms. We show how a s...
متن کاملA Decidable Very Expressive n-ary Description Logic for Database Applications (extended abstract)
We introduce DLR ,̀ an extension of the n-ary propositionally closed description logic DLR to deal with attribute-labelled tuples (generalising the positional notation), projections of relations, and global and local objectification of relations, able to express inclusion, functional, key, and external uniqueness dependencies. The logic is equipped with both TBox and ABox axioms forming a DLR` k...
متن کاملA note on parallel and alternating time
where equivalent under polynomial bounds. In other words, the complexity classes defined by parallel polynomial time, alternating polynomial time, and polynomial space are actually the same class. In contrast with the above, it was soon remarked that in the theory of complexity over the reals developed by Blum, Shub, and Smale [2], every decidable set can be decided using constant workspace [8]...
متن کاملThe undecidability of propositional adaptive logic
We investigate and classify the notion of final derivability of two basic inconsistency-adaptive logics. Specifically, the maximal complexity of the set of final consequences of decidable sets of premises formulated in the language of propositional logic is described. Our results show that taking the consequences of a decidable propositional theory is a complicated operation. The set of final c...
متن کامل